0.02/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.11	% Command    : run_E %s %d THM
0.11/0.31	% Computer : n011.cluster.edu
0.11/0.31	% Model    : x86_64 x86_64
0.11/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.31	% Memory   : 8042.1875MB
0.11/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.31	% CPULimit   : 960
0.11/0.31	% WCLimit    : 120
0.11/0.31	% DateTime   : Tue Aug  9 05:48:06 EDT 2022
0.11/0.32	% CPUTime    : 
0.16/0.44	Running higher-order on 8 cores theorem proving
0.16/0.44	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.16/0.44	# Version: 3.0pre003-ho
0.94/0.58	# Preprocessing class: HSLSSMSSSSSNHSA.
0.94/0.58	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.94/0.58	# Starting full_lambda_9 with 600s (5) cores
0.94/0.58	# Starting new_ho_11 with 120s (1) cores
0.94/0.58	# Starting sh2l with 120s (1) cores
0.94/0.58	# Starting new_bool_6 with 120s (1) cores
0.94/0.58	# sh2l with pid 27022 completed with status 0
0.94/0.58	# Result found by sh2l
0.94/0.58	# Preprocessing class: HSLSSMSSSSSNHSA.
0.94/0.58	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.94/0.58	# Starting full_lambda_9 with 600s (5) cores
0.94/0.58	# Starting new_ho_11 with 120s (1) cores
0.94/0.58	# Starting sh2l with 120s (1) cores
0.94/0.58	# SinE strategy is gf120_gu_RUU_F100_L01000
0.94/0.58	# ...ProofStateSinE()=211/286
0.94/0.58	# Search class: HGHSM-FSLF32-MHSFFSBC
0.94/0.58	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.94/0.58	# Starting new_ho_10 with 65s (1) cores
0.94/0.58	# new_ho_10 with pid 27030 completed with status 0
0.94/0.58	# Result found by new_ho_10
0.94/0.58	# Preprocessing class: HSLSSMSSSSSNHSA.
0.94/0.58	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.94/0.58	# Starting full_lambda_9 with 600s (5) cores
0.94/0.58	# Starting new_ho_11 with 120s (1) cores
0.94/0.58	# Starting sh2l with 120s (1) cores
0.94/0.58	# SinE strategy is gf120_gu_RUU_F100_L01000
0.94/0.58	# ...ProofStateSinE()=211/286
0.94/0.58	# Search class: HGHSM-FSLF32-MHSFFSBC
0.94/0.58	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.94/0.58	# Starting new_ho_10 with 65s (1) cores
0.94/0.58	# Preprocessing time       : 0.010 s
0.94/0.58	# Presaturation interreduction done
0.94/0.58	
0.94/0.58	# Proof found!
0.94/0.58	# SZS status Theorem
0.94/0.58	# SZS output start CNFRefutation
0.94/0.58	thf(decl_22, type, minus_minus_nat: nat > nat > nat).
0.94/0.58	thf(decl_23, type, plus_plus_nat: nat > nat > nat).
0.94/0.58	thf(decl_24, type, if_nat: $o > nat > nat > nat).
0.94/0.58	thf(decl_25, type, if_a: $o > a > a > a).
0.94/0.58	thf(decl_26, type, list_asc_nat: list_nat > $o).
0.94/0.58	thf(decl_27, type, list_desc_nat: list_nat > $o).
0.94/0.58	thf(decl_28, type, list_strict_asc_nat: list_nat > $o).
0.94/0.58	thf(decl_29, type, list_strict_desc_nat: list_nat > $o).
0.94/0.58	thf(decl_30, type, listIn923761578nd_nat: list_nat > (nat > nat) > nat > nat).
0.94/0.58	thf(decl_31, type, listIn1312259492pend_a: list_a > (nat > a) > nat > a).
0.94/0.58	thf(decl_32, type, listIn870223551op_nat: nat > (nat > nat) > nat > nat).
0.94/0.58	thf(decl_33, type, listIn1417627087drop_a: nat > (nat > a) > nat > a).
0.94/0.58	thf(decl_34, type, listIn1299132951ke_nat: nat > (nat > nat) > list_nat).
0.94/0.58	thf(decl_35, type, listIn84854903take_a: nat > (nat > a) > list_a).
0.94/0.58	thf(decl_36, type, append_nat: list_nat > list_nat > list_nat).
0.94/0.58	thf(decl_37, type, append_a: list_a > list_a > list_a).
0.94/0.58	thf(decl_38, type, drop_nat: nat > list_nat > list_nat).
0.94/0.58	thf(decl_39, type, drop_a: nat > list_a > list_a).
0.94/0.58	thf(decl_40, type, last_nat: list_nat > nat).
0.94/0.58	thf(decl_41, type, last_a: list_a > a).
0.94/0.58	thf(decl_42, type, nth_nat: list_nat > nat > nat).
0.94/0.58	thf(decl_43, type, nth_a: list_a > nat > a).
0.94/0.58	thf(decl_44, type, size_size_list_nat: list_nat > nat).
0.94/0.58	thf(decl_45, type, size_size_list_a: list_a > nat).
0.94/0.58	thf(decl_46, type, ord_less_nat: nat > nat > $o).
0.94/0.58	thf(decl_47, type, ord_less_eq_nat: nat > nat > $o).
0.94/0.58	thf(decl_48, type, f: nat > a).
0.94/0.58	thf(decl_49, type, n: nat).
0.94/0.58	thf(decl_50, type, xs: list_a).
0.94/0.58	thf(decl_51, type, esk1_1: nat > list_a).
0.94/0.58	thf(decl_52, type, esk2_1: (list_a > $o) > list_a).
0.94/0.58	thf(decl_53, type, esk3_4: list_a > (nat > a) > list_a > (nat > a) > list_a).
0.94/0.58	thf(decl_54, type, esk4_4: list_a > (nat > a) > list_a > (nat > a) > list_a).
0.94/0.58	thf(decl_55, type, esk5_4: list_a > (nat > a) > list_a > (nat > a) > list_a).
0.94/0.58	thf(decl_56, type, esk6_1: nat > nat).
0.94/0.58	thf(decl_57, type, esk7_4: nat > nat > (nat > nat) > nat > nat).
0.94/0.58	thf(decl_58, type, esk8_4: nat > nat > (nat > nat) > nat > nat).
0.94/0.58	thf(decl_59, type, esk9_1: nat > nat).
0.94/0.58	thf(decl_60, type, esk10_1: nat > nat).
0.94/0.58	thf(decl_61, type, esk11_1: (nat > $o) > nat).
0.94/0.58	thf(decl_62, type, esk12_4: nat > (nat > nat) > nat > nat > nat).
0.94/0.58	thf(decl_63, type, esk13_4: nat > (nat > nat) > nat > nat > nat).
0.94/0.58	thf(decl_64, type, esk14_3: (nat > $o) > (nat > $o) > nat > nat).
0.94/0.58	thf(decl_65, type, esk15_5: (nat > $o) > (nat > $o) > (nat > $o) > (nat > $o) > nat > nat).
0.94/0.58	thf(decl_66, type, esk16_4: (nat > $o) > (nat > $o) > (nat > $o) > (nat > $o) > nat).
0.94/0.58	thf(decl_67, type, esk17_1: nat > nat).
0.94/0.58	thf(decl_68, type, esk18_3: (nat > $o) > (nat > $o) > nat > nat).
0.94/0.58	thf(decl_69, type, esk19_5: (nat > $o) > (nat > $o) > (nat > $o) > (nat > $o) > nat > nat).
0.94/0.58	thf(decl_70, type, esk20_4: (nat > $o) > (nat > $o) > (nat > $o) > (nat > $o) > nat).
0.94/0.58	thf(decl_71, type, esk21_1: (nat > nat > $o) > nat).
0.94/0.58	thf(decl_72, type, esk22_1: (nat > nat > $o) > nat).
0.94/0.58	thf(decl_73, type, esk23_1: (nat > nat > $o) > nat).
0.94/0.58	thf(decl_74, type, esk24_1: (nat > nat > $o) > nat).
0.94/0.58	thf(decl_75, type, esk25_1: (nat > nat > $o) > nat).
0.94/0.58	thf(decl_76, type, esk26_1: nat > nat).
0.94/0.58	thf(decl_77, type, esk27_1: nat > nat).
0.94/0.58	thf(decl_78, type, esk28_1: (nat > $o) > nat).
0.94/0.58	thf(decl_79, type, esk29_3: (nat > $o) > (nat > $o) > nat > nat).
0.94/0.58	thf(decl_80, type, esk30_5: (nat > $o) > (nat > $o) > (nat > $o) > (nat > $o) > nat > nat).
0.94/0.58	thf(decl_81, type, esk31_4: (nat > $o) > (nat > $o) > (nat > $o) > (nat > $o) > nat).
0.94/0.58	thf(decl_82, type, esk32_1: nat > nat).
0.94/0.58	thf(decl_83, type, esk33_1: nat > nat).
0.94/0.58	thf(decl_84, type, esk34_1: (nat > $o) > nat).
0.94/0.58	thf(decl_85, type, esk35_1: (nat > $o) > nat).
0.94/0.58	thf(decl_86, type, esk36_2: (nat > $o) > nat > nat).
0.94/0.58	thf(decl_87, type, esk37_1: (nat > $o) > nat).
0.94/0.58	thf(decl_88, type, esk38_4: nat > nat > (nat > nat) > nat > nat).
0.94/0.58	thf(decl_89, type, esk39_4: nat > nat > (nat > nat) > nat > nat).
0.94/0.58	thf(decl_90, type, esk40_1: nat > nat).
0.94/0.58	thf(decl_91, type, esk41_4: nat > (nat > nat) > nat > nat > nat).
0.94/0.58	thf(decl_92, type, esk42_4: nat > (nat > nat) > nat > nat > nat).
0.94/0.58	thf(decl_93, type, esk43_3: (nat > $o) > (nat > $o) > nat > nat).
0.94/0.58	thf(decl_94, type, esk44_5: (nat > $o) > (nat > $o) > (nat > $o) > (nat > $o) > nat > nat).
0.94/0.58	thf(decl_95, type, esk45_4: (nat > $o) > (nat > $o) > (nat > $o) > (nat > $o) > nat).
0.94/0.58	thf(decl_96, type, esk46_2: list_a > list_a > nat).
0.94/0.58	thf(decl_97, type, esk47_4: nat > (nat > nat) > nat > nat > nat).
0.94/0.58	thf(decl_98, type, esk48_4: nat > (nat > nat) > nat > nat > nat).
0.94/0.58	thf(decl_99, type, esk49_1: nat > nat).
0.94/0.58	thf(decl_100, type, esk50_1: nat > nat).
0.94/0.58	thf(decl_101, type, esk51_2: (nat > $o) > nat > nat).
0.94/0.58	thf(decl_102, type, esk52_1: (nat > $o) > nat).
0.94/0.58	thf(decl_103, type, esk53_4: nat > nat > (nat > nat) > nat > nat).
0.94/0.58	thf(decl_104, type, esk54_4: nat > nat > (nat > nat) > nat > nat).
0.94/0.58	thf(decl_105, type, esk55_4: nat > nat > (nat > nat) > nat > nat).
0.94/0.58	thf(decl_106, type, esk56_4: nat > nat > (nat > nat) > nat > nat).
0.94/0.58	thf(decl_107, type, esk57_4: nat > (nat > nat) > nat > nat > nat).
0.94/0.58	thf(decl_108, type, esk58_4: nat > (nat > nat) > nat > nat > nat).
0.94/0.58	thf(decl_109, type, esk59_4: nat > (nat > nat) > nat > nat > nat).
0.94/0.58	thf(decl_110, type, esk60_4: nat > (nat > nat) > nat > nat > nat).
0.94/0.58	thf(decl_111, type, esk61_4: nat > (nat > nat) > nat > nat > nat).
0.94/0.58	thf(decl_112, type, esk62_4: nat > (nat > nat) > nat > nat > nat).
0.94/0.58	thf(decl_113, type, esk63_2: nat > nat > nat).
0.94/0.58	thf(decl_114, type, esk64_2: nat > nat > nat).
0.94/0.58	thf(decl_115, type, esk65_1: nat > nat).
0.94/0.58	thf(decl_116, type, esk66_1: nat > nat).
0.94/0.58	thf(decl_117, type, esk67_3: nat > nat > (nat > $o) > nat).
0.94/0.58	thf(decl_118, type, esk68_4: nat > nat > (nat > $o) > nat > nat).
0.94/0.58	thf(decl_119, type, esk69_2: nat > (nat > $o) > nat).
0.94/0.58	thf(decl_120, type, esk70_2: nat > (nat > $o) > nat).
0.94/0.58	thf(decl_121, type, esk71_1: (nat > nat > $o) > nat).
0.94/0.58	thf(decl_122, type, esk72_1: (nat > nat > $o) > nat).
0.94/0.58	thf(decl_123, type, esk73_1: (nat > nat > $o) > nat).
0.94/0.58	thf(decl_124, type, esk74_1: (nat > nat > $o) > nat).
0.94/0.58	thf(decl_125, type, esk75_4: nat > nat > (nat > nat) > nat > nat).
0.94/0.58	thf(decl_126, type, esk76_4: nat > nat > (nat > nat) > nat > nat).
0.94/0.58	thf(decl_127, type, esk77_1: (nat > nat) > nat).
0.94/0.58	thf(decl_128, type, esk78_1: (nat > nat) > nat).
0.94/0.58	thf(decl_129, type, esk79_4: nat > nat > (nat > nat) > nat > nat).
0.94/0.58	thf(decl_130, type, esk80_4: nat > nat > (nat > nat) > nat > nat).
0.94/0.58	thf(decl_131, type, esk81_2: nat > nat > nat).
0.94/0.58	thf(decl_132, type, esk82_2: nat > nat > nat).
0.94/0.58	thf(decl_133, type, esk83_4: list_a > list_a > list_a > list_a > list_a).
0.94/0.58	thf(decl_134, type, esk84_4: list_a > list_a > list_a > list_a > list_a).
0.94/0.58	thf(decl_135, type, esk85_2: list_a > list_a > nat).
0.94/0.58	thf(decl_136, type, esk86_2: list_a > list_a > nat).
0.94/0.58	thf(decl_137, type, esk87_2: nat > (nat > a > $o) > nat).
0.94/0.58	thf(decl_138, type, esk88_2: nat > (nat > a > $o) > list_a).
0.94/0.58	thf(decl_139, type, esk89_3: nat > (nat > a > $o) > list_a > nat).
0.94/0.58	thf(decl_140, type, esk90_3: nat > (nat > a > $o) > nat > a).
0.94/0.58	thf(decl_141, type, esk91_0: nat).
0.94/0.58	thf(decl_142, type, esk92_0: nat).
0.94/0.58	thf(decl_143, type, esk93_0: nat).
0.94/0.58	thf(decl_144, type, esk94_0: nat).
0.94/0.58	thf(decl_145, type, esk95_0: nat).
0.94/0.58	thf(decl_146, type, esk96_0: nat).
0.94/0.58	thf(decl_147, type, esk97_3: list_a > (nat > a) > (nat > a) > nat).
0.94/0.58	thf(decl_148, type, esk98_4: list_a > (nat > a) > (nat > a) > list_a > nat).
0.94/0.58	thf(decl_149, type, esk99_4: list_a > (nat > a) > (nat > a) > list_a > nat).
0.94/0.58	thf(decl_150, type, esk100_3: list_a > (nat > a) > (nat > a) > nat).
0.94/0.58	thf(decl_151, type, esk101_4: list_a > (nat > a) > (nat > a) > list_a > nat).
0.94/0.58	thf(decl_152, type, esk102_0: nat).
0.94/0.58	thf(conj_0, conjecture, ((((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f))<=(ord_less_nat @ n @ (size_size_list_a @ xs)))&(~((ord_less_nat @ n @ (size_size_list_a @ xs)))=>((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))=(listIn1417627087drop_a @ (minus_minus_nat @ n @ (size_size_list_a @ xs)) @ f)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
0.94/0.58	thf(fact_35_i__append__i__drop__eq2, axiom, ![X6:list_a, X10:nat, X8:nat > a]:((((listIn1417627087drop_a @ X10 @ (listIn1312259492pend_a @ X6 @ X8))=(listIn1417627087drop_a @ (minus_minus_nat @ X10 @ (size_size_list_a @ X6)) @ X8))<=(ord_less_eq_nat @ (size_size_list_a @ X6) @ X10))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_35_i__append__i__drop__eq2)).
0.94/0.58	thf(fact_198_not__le, axiom, ![X25:nat, X26:nat]:((~((ord_less_eq_nat @ X25 @ X26))<=>(ord_less_nat @ X26 @ X25))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_198_not__le)).
0.94/0.58	thf(fact_203_less__le, axiom, ((ord_less_nat)=(^[X37:nat, X38:nat]:((((X37)!=(X38))&(ord_less_eq_nat @ X37 @ X38))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_203_less__le)).
0.94/0.58	thf(fact_33_i__append__i__drop__eq1, axiom, ![X10:nat, X6:list_a, X8:nat > a]:(((ord_less_eq_nat @ X10 @ (size_size_list_a @ X6))=>((listIn1417627087drop_a @ X10 @ (listIn1312259492pend_a @ X6 @ X8))=(listIn1312259492pend_a @ (drop_a @ X10 @ X6) @ X8)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_33_i__append__i__drop__eq1)).
0.94/0.58	thf(c_0_5, negated_conjecture, ~((((ord_less_nat @ n @ (size_size_list_a @ xs))=>((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f)))&(~(ord_less_nat @ n @ (size_size_list_a @ xs))=>((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))=(listIn1417627087drop_a @ (minus_minus_nat @ n @ (size_size_list_a @ xs)) @ f))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
0.94/0.58	thf(c_0_6, plain, ![X6:list_a, X10:nat, X8:nat > a]:(((ord_less_eq_nat @ (size_size_list_a @ X6) @ X10)=>((listIn1417627087drop_a @ X10 @ (listIn1312259492pend_a @ X6 @ X8))=(listIn1417627087drop_a @ (minus_minus_nat @ X10 @ (size_size_list_a @ X6)) @ X8)))), inference(fof_simplification,[status(thm)],[fact_35_i__append__i__drop__eq2])).
0.94/0.58	thf(c_0_7, plain, ![X25:nat, X26:nat]:((~(ord_less_eq_nat @ X25 @ X26)<=>(ord_less_nat @ X26 @ X25))), inference(fof_simplification,[status(thm)],[fact_198_not__le])).
0.94/0.58	thf(c_0_8, negated_conjecture, (((~(ord_less_nat @ n @ (size_size_list_a @ xs))|(ord_less_nat @ n @ (size_size_list_a @ xs)))&(((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1417627087drop_a @ (minus_minus_nat @ n @ (size_size_list_a @ xs)) @ f))|(ord_less_nat @ n @ (size_size_list_a @ xs))))&((~(ord_less_nat @ n @ (size_size_list_a @ xs))|((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f)))&(((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1417627087drop_a @ (minus_minus_nat @ n @ (size_size_list_a @ xs)) @ f))|((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])).
0.94/0.58	thf(c_0_9, plain, ![X813:list_a, X814:nat, X815:nat > a]:((~(ord_less_eq_nat @ (size_size_list_a @ X813) @ X814)|((listIn1417627087drop_a @ X814 @ (listIn1312259492pend_a @ X813 @ X815))=(listIn1417627087drop_a @ (minus_minus_nat @ X814 @ (size_size_list_a @ X813)) @ X815)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])).
0.94/0.58	thf(c_0_10, plain, ![X1252:nat, X1253:nat]:((((ord_less_eq_nat @ X1252 @ X1253)|(ord_less_nat @ X1253 @ X1252))&(~(ord_less_nat @ X1253 @ X1252)|~(ord_less_eq_nat @ X1252 @ X1253)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])).
0.94/0.58	thf(c_0_11, plain, ![X779:nat, X780:nat]:(((ord_less_nat @ X779 @ X780)<=>(((X779)!=(X780))&(ord_less_eq_nat @ X779 @ X780)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_203_less__le])])).
0.94/0.58	thf(c_0_12, negated_conjecture, ((ord_less_nat @ n @ (size_size_list_a @ xs))|((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1417627087drop_a @ (minus_minus_nat @ n @ (size_size_list_a @ xs)) @ f))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.94/0.58	thf(c_0_13, plain, ![X8:nat > a, X6:list_a, X2:nat]:((((listIn1417627087drop_a @ X2 @ (listIn1312259492pend_a @ X6 @ X8))=(listIn1417627087drop_a @ (minus_minus_nat @ X2 @ (size_size_list_a @ X6)) @ X8))|~((ord_less_eq_nat @ (size_size_list_a @ X6) @ X2)))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.94/0.58	thf(c_0_14, plain, ![X3:nat, X2:nat]:(((ord_less_eq_nat @ X2 @ X3)|(ord_less_nat @ X3 @ X2))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.94/0.58	thf(c_0_15, plain, ![X1186:nat, X1187:nat]:((((((X1186)!=(X1187))|~(ord_less_nat @ X1186 @ X1187))&((ord_less_eq_nat @ X1186 @ X1187)|~(ord_less_nat @ X1186 @ X1187)))&(((X1186)=(X1187))|~(ord_less_eq_nat @ X1186 @ X1187)|(ord_less_nat @ X1186 @ X1187)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])).
0.94/0.58	thf(c_0_16, negated_conjecture, (~((ord_less_nat @ n @ (size_size_list_a @ xs)))|((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.94/0.58	thf(c_0_17, negated_conjecture, (ord_less_nat @ n @ (size_size_list_a @ xs)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])).
0.94/0.58	thf(c_0_18, plain, ![X819:nat, X820:list_a, X821:nat > a]:((~(ord_less_eq_nat @ X819 @ (size_size_list_a @ X820))|((listIn1417627087drop_a @ X819 @ (listIn1312259492pend_a @ X820 @ X821))=(listIn1312259492pend_a @ (drop_a @ X819 @ X820) @ X821)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_33_i__append__i__drop__eq1])])).
0.94/0.58	thf(c_0_19, plain, ![X2:nat, X3:nat]:(((ord_less_eq_nat @ X2 @ X3)|~((ord_less_nat @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_15])).
0.94/0.58	thf(c_0_20, negated_conjecture, ((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_17])])).
0.94/0.58	thf(c_0_21, plain, ![X2:nat, X8:nat > a, X6:list_a]:((((listIn1417627087drop_a @ X2 @ (listIn1312259492pend_a @ X6 @ X8))=(listIn1312259492pend_a @ (drop_a @ X2 @ X6) @ X8))|~((ord_less_eq_nat @ X2 @ (size_size_list_a @ X6))))), inference(split_conjunct,[status(thm)],[c_0_18])).
0.94/0.58	thf(c_0_22, negated_conjecture, (ord_less_eq_nat @ n @ (size_size_list_a @ xs)), inference(spm,[status(thm)],[c_0_19, c_0_17])).
0.94/0.58	thf(c_0_23, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])]), ['proof']).
0.94/0.58	# SZS output end CNFRefutation
0.94/0.58	# Parsed axioms                        : 286
0.94/0.58	# Removed by relevancy pruning/SinE    : 75
0.94/0.58	# Initial clauses                      : 548
0.94/0.58	# Removed in clause preprocessing      : 23
0.94/0.58	# Initial clauses in saturation        : 525
0.94/0.58	# Processed clauses                    : 744
0.94/0.58	# ...of these trivial                  : 9
0.94/0.58	# ...subsumed                          : 203
0.94/0.58	# ...remaining for further processing  : 531
0.94/0.58	# Other redundant clauses eliminated   : 75
0.94/0.58	# Clauses deleted for lack of memory   : 0
0.94/0.58	# Backward-subsumed                    : 2
0.94/0.58	# Backward-rewritten                   : 4
0.94/0.58	# Generated clauses                    : 1081
0.94/0.58	# ...of the previous two non-redundant : 906
0.94/0.58	# ...aggressively subsumed             : 0
0.94/0.58	# Contextual simplify-reflections      : 3
0.94/0.58	# Paramodulations                      : 971
0.94/0.58	# Factorizations                       : 4
0.94/0.58	# NegExts                              : 12
0.94/0.58	# Equation resolutions                 : 93
0.94/0.58	# Propositional unsat checks           : 0
0.94/0.58	#    Propositional check models        : 0
0.94/0.58	#    Propositional check unsatisfiable : 0
0.94/0.58	#    Propositional clauses             : 0
0.94/0.58	#    Propositional clauses after purity: 0
0.94/0.58	#    Propositional unsat core size     : 0
0.94/0.58	#    Propositional preprocessing time  : 0.000
0.94/0.58	#    Propositional encoding time       : 0.000
0.94/0.58	#    Propositional solver time         : 0.000
0.94/0.58	#    Success case prop preproc time    : 0.000
0.94/0.58	#    Success case prop encoding time   : 0.000
0.94/0.58	#    Success case prop solver time     : 0.000
0.94/0.58	# Current number of processed clauses  : 142
0.94/0.58	#    Positive orientable unit clauses  : 27
0.94/0.58	#    Positive unorientable unit clauses: 2
0.94/0.58	#    Negative unit clauses             : 24
0.94/0.58	#    Non-unit-clauses                  : 89
0.94/0.58	# Current number of unprocessed clauses: 1015
0.94/0.58	# ...number of literals in the above   : 3214
0.94/0.58	# Current number of archived formulas  : 0
0.94/0.58	# Current number of archived clauses   : 334
0.94/0.58	# Clause-clause subsumption calls (NU) : 40662
0.94/0.58	# Rec. Clause-clause subsumption calls : 6510
0.94/0.58	# Non-unit clause-clause subsumptions  : 173
0.94/0.58	# Unit Clause-clause subsumption calls : 412
0.94/0.58	# Rewrite failures with RHS unbound    : 0
0.94/0.58	# BW rewrite match attempts            : 40
0.94/0.58	# BW rewrite match successes           : 7
0.94/0.58	# Condensation attempts                : 744
0.94/0.58	# Condensation successes               : 18
0.94/0.58	# Termbank termtop insertions          : 88810
0.94/0.58	
0.94/0.58	# -------------------------------------------------
0.94/0.58	# User time                : 0.118 s
0.94/0.58	# System time              : 0.012 s
0.94/0.58	# Total time               : 0.130 s
0.94/0.58	# Maximum resident set size: 4072 pages
0.94/0.58	
0.94/0.58	# -------------------------------------------------
0.94/0.58	# User time                : 0.126 s
0.94/0.58	# System time              : 0.013 s
0.94/0.58	# Total time               : 0.139 s
0.94/0.58	# Maximum resident set size: 2196 pages
0.94/0.58	EOF